On Decomposable Operators
نویسندگان
چکیده
منابع مشابه
On the decomposable numerical range of operators
Let $V$ be an $n$-dimensional complex inner product space. Suppose $H$ is a subgroup of the symmetric group of degree $m$, and $chi :Hrightarrow mathbb{C} $ is an irreducible character (not necessarily linear). Denote by $V_{chi}(H)$ the symmetry class of tensors associated with $H$ and $chi$. Let $K(T)in (V_{chi}(H))$ be the operator induced by $Tin text{End}(V)$. Th...
متن کاملon the decomposable numerical range of operators
let $v$ be an $n$-dimensional complex inner product space. suppose $h$ is a subgroup of the symmetric group of degree $m$, and $chi :hrightarrow mathbb{c} $ is an irreducible character (not necessarily linear). denote by $v_{chi}(h)$ the symmetry class of tensors associated with $h$ and $chi$. let $k(t)in (v_{chi}(h))$ be the operator induced by $tin text{end}(v)$. the...
متن کاملOn decomposable random graphs
Abstract: Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs. This is achieved through dimensionality expansion that causes the graph nodes to be conditionally independent given a latent tree. The Markov updat...
متن کاملOn Randomly Pk-Decomposable Graphs
A graph G is ramdomly H–decomposable if every family of edge disjoint subgraphs of G, each subgraph isomorphic to H , can be extended to an H–decomposition of G. Let Pk denote a path of length k. In this paper we characterize all ramdomly P3– decomposable graphs and ramdomly P4–decomposable graphs. We also characterize all ramdomly Pk–decomposable graphs of size 2k where all vertices have even ...
متن کاملOn Algorithms for Decomposable Constraints
Non-binary constraints are present in many real-world constraint satisfaction problems. Certain classes of these constraints, like the all-different constraint, are “decomposable”. That is, they can be represented by binary constraints on the same set of variables. For example, a non-binary all-different constraint can be decomposed into a clique of binary not-equals constraints. In this paper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1970
ISSN: 0002-9939
DOI: 10.2307/2036731